Graph Theory Towards Module-K Odd-Elegant Labelling Of Graphical Passwords
نویسندگان
چکیده
منابع مشابه
Predicting Graphical Passwords
Over the last decade, the popularity of graphical passwords has increased tremendously. They can now be found on various devices and systems, including platforms such as the Windows 8 and Android operating systems. In this paper, we focus on the PassPoints graphicalpassword scheme and investigate the extent to which these passwords might be predicted based on knowledge of the individual (e.g., ...
متن کاملAccessibility and Graphical Passwords
In this brief paper, we explore the issue of accessible authentication with respect to click-based graphical passwords. These schemes normally rely on complex visual presentation and fine motor control for pointing. We take the approach of identifying the semantic structure, and show how the same kind of scheme could work with alternative interaction modalities. In particular, we explore the us...
متن کاملGraphical Passwords FABIAN
GRAPHICAL PASSWORD IS A SECRET THAT A HUMAN USER INPUTS TO A COMPUTER WITH THE AID OF the computer’s graphical input (e.g., mouse, stylus, or touch screen) and output devices. In this chapter, we review the arguments supporting graphical passwords as being potentially superior to text passwords, present several graphical password designs, and discuss some analyses of graphical password memorabi...
متن کاملSecurity Analysis of Graphical Passwords over the Alphanumeric Passwords
Security in the computer is largely supported by the passwords for authentication process. The most common approach for authentication is alphanumeric passwords and alphanumeric passwords which has significant drawbacks. To overcome these drawbacks graphical passwords have been designed. That aim of generating these passwords to make passwords more memorable and easier for people to use and, th...
متن کاملDOMINATION NUMBER OF TOTAL GRAPH OF MODULE
Let $R$ be a commutative ring and $M$ be an $R$-module with $T(M)$ as subset, the set of torsion elements. The total graph of the module denoted by $T(Gamma(M))$, is the (undirected) graph with all elements of $M$ as vertices, and for distinct elements $n,m in M$, the vertices $n$ and $m$ are adjacent if and only if $n+m in T(M)$. In this paper we study the domination number of $T(Gamma(M))$ a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: MATEC Web of Conferences
سال: 2017
ISSN: 2261-236X
DOI: 10.1051/matecconf/201713900206